An Integer Linear Programming approach to the single and bi-objective Next Release Problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Integer Linear Programming approach to the single and bi-objective Next Release Problem

Context: The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, Integer Linear Programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques. Objective: In this ...

متن کامل

A two-stage approach for bi-objective integer linear programming

We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...

متن کامل

Goal Programming Approach to the Bi-Objective Competitive Flow-Capturing Location-Allocation Problem

  Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the c...

متن کامل

A parallel approach to bi-objective integer programming

To obtain a better understanding of the trade-offs between various objectives, Bi-Objective Integer Programming (BOIP) algorithms calculate the set of all non-dominated vectors and present these as the solution to a BOIP problem. Historically, these algorithms have been compared in terms of the number of single-objective IPs solved and total CPU time taken to produce the solution to a problem. ...

متن کامل

Dynamic programming algorithms for the bi-objective integer knapsack problem

This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multiobjective integer knapsack problem is identified. The first algorithm is developed by directly using the property. The second algorithm is a hybrid DP approach using the concept of the boun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Software Technology

سال: 2015

ISSN: 0950-5849

DOI: 10.1016/j.infsof.2015.03.008